The Dynamic Vehicle Routing Problem

نویسندگان

  • Allan Larsen
  • Hans Meyer
چکیده

The subject of the thesis is to investigate the dynamic version of the well-known vehicle routing problem in order to improve the performance of existing algorithms as well as to develop new algorithms. I would like to express my gratitude to Transportrådet for their belief and interest in this project. Next, I would like to thank my thesis advisor, professor Oli B.G. Madsen, for his support and interest through this project. I have now served as Oli's master student, teaching/research assistant and lately as his Ph.D.-student for more than five years and I have enjoyed working with Oli from the very first day. I would also like to thank professor Marius M. Solomon of Northeastern University in Boston, Massachusetts, for our collaboration on the technical report first presented at the Tristan III conference in Puerto Rico in 1998 and for providing good comments on and ideas for chapter 4 and 5. European Club at M.I.T. are thanked for making my stay in the US such a memorable experience. I also wish to thank my old colleague Karsten Lund for his persistency and devotion while getting his old code tuned for my new data. Along the same line Rene Munk Jørgensen is thanked for writing the software for finding the coordinates of the real-life problem presented in the thesis. Søren Andersen and his colleagues at United Parcel Services are thanked for answering my endless number of questions as well as allowing me to use their data for a real-life data analysis. Also, the staff-the academic as well as the administrative-at the Department of Mathematical Modelling (IMM) should be thanked for their friendly attitude. I have indeed enjoyed being a student and an employee at the Department from day one. Especially, my fellow members of the Operations Research Cake Group (ORCG) are thanked for providing more than the calories needed in order to perform the research of this thesis. Lisbeth Mohr is thanked for her big effort in listing the numerous typos and bad structured sentences in the preliminary version of the thesis. Finally, I would like to thank my family, friends and last but certainly not least my girlfriend Camilla for all their love and support throughout the three years it took to prepare this thesis. Summary During recent years distribution systems have become increasingly complex. This development is partly due to the high number of company mergers which leave distribution …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A time-dependent vehicle routing problem for disaster response phase in multi-graph-based network

Logistics planning in disaster response phase involves dispatching commodities such as medical materials, personnel, food, etc. to affected areas as soon as possible to accelerate the relief operations. Since transportation vehicles in disaster situations can be considered as scarce resources, thus, the efficient usage of them is substantially important. In this study, we provide a dynamic vehi...

متن کامل

A Vehicle Routing Problem with Inventory in a Hybrid Uncertain Environment

Manufacturers, who re-supply a large number of customers, continually struggle with the question of how to formulate a replenishment strategy. The purpose of this paper is to determine the optimal set of routes for a group of vehicles in the transportation network under defined constraints – which is known as the Vehicle Routing Problem (VRP) – delivering new items, and resolving the invent...

متن کامل

A Goal Programming Model for Single Vehicle Routing Problem with Multiple Routes

The single vehicle routing problem with multiple routes is a variant of the vehicle routing problem where the vehicle can be dispatched to several routes during its workday to serve a number of customers. In this paper we propose a goal programming model for multi-objective single vehicle routing problem with time windows and multiple routes. To solve the model, we present a heuristic method wh...

متن کامل

An Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems

Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...

متن کامل

Stochastic Approach to Vehicle Routing Problem: Development and Theories

Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...

متن کامل

Three New Heuristic Algorithms For The Fleet Size And Mix Green Vehicle Routing Problem

In recent years, great efforts have been made to reduce greenhouse gas emissions by vehicles. Petroleum products produces greenhouse gas emissions, therefore reducing the use of these products can make a major contribution to reducing pollution. The Fleet Size and Mix Vehicle Routing Problem is one of the most widely used routing branches. In this problem, there are vehicle with different capac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001